Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
نویسندگان
چکیده
منابع مشابه
Non-polynomial Spline Method for Solving Coupled Burgers Equations
In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...
متن کاملEfficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best known algorithms are exhaustive search for small fields, and a Gröbner base algorithm for large fields. Gröbner base algorit...
متن کاملDesigning Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials∗
In recent years, several powerful techniques have been developed to design randomized polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space parameterized algorithms. Our approach aims at reducing the number of random choices by exploiting the special structure of a solution. Using our approach, we derive po...
متن کاملOn Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering. In Artificial Intelligence, BCP can be used for computing minimum-size prime implicants of Boolean functions, of interest in Automated Reasoning and Non-Monotonic Reasoning. Binate Coverin...
متن کاملAlgorithms for Solving Equations
The main goal of this work is an attempt to understand the efficiency of algorithms for solving systems of equations. For example, consider a map / from complex Cartesian space C n to C n given by polynomials. How fast can one find good approximations to one or all of the zeros of / ? However, for clarity of exposition and development we will usually swing from one extreme to another about this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2971393